Transitivity and partial order

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Economic order quantity with partial backordering and sampling inspection

To access the efficient inventory system, managers should consider all the situations that have happened in reality. One of these situations is the presence of the defective items in each received lot and the other situation is being the group of customers that do not wait to fulfill their requirements from the vendor and choose another one to get their orders so the proportion of the backorder...

متن کامل

Topological Transitivity and Strong Transitivity

We discuss the relation between (topological) transitivity and strong transitivity of dynamical systems. We show that a transitive and open self-map of a compact metric space satisfying a certain expanding condition is strongly transitive. We also prove a couple of results for interval maps; for example it is shown that a transitive piecewise monotone interval map is strongly transitive.

متن کامل

Partial Order

Ginsberg has recently introduced a polynomial space aggressive dependency directed backtrack search technique. Aggressive dependency directed techniques have the property that the size of the search space generated by a union of disjoint subproblems is proportional to the sum of the search space generated by each problem independently. Earlier polynomial space dependency directed methods did no...

متن کامل

Partial Order and Contextual Net

We present two concurrent semantics (i.e. semantics where concurrency is ex-plicitely represented) for CC programs with atomic tells. One is based on simple partial orders of computation steps, while the other one is based on contextual nets and it is an extension of a previous one for eventual CC programs. Both such semantics allow us to derive concurrency, dependency, and nondeterminism infor...

متن کامل

Static Partial Order Reduction

1 I n t r o d u c t i o n One c o m m o n me thod for dealing with the intrinsically intractable computa t iona l complexi ty of model-checking asynchronous systems is partial order reduction. This reduct ion technique exploits the c o m m o n practice of model ing concurrent events in asynchronous systems as an interleaving of the events in all possible execution orders. An impor t an t observ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematica Bohemica

سال: 1997

ISSN: 0862-7959,2464-7136

DOI: 10.21136/mb.1997.126183